Completeness and Decidability of a Fragment of Duration Calculus with Iteration
نویسندگان
چکیده
Duration Calculus with Iteration (DC∗) has been used as an interface between original Duration Calculus and Timed Automata, but has not been studied rigorously. In this paper, we study a subset of DC∗ formulas consisting of so-called simple ones which corresponds precisely with the class of Timed Automata. We give a complete proof system and the decidability results for the subset.
منابع مشابه
Completeness and Decidability of a Fragment of Duration Calculus with Iteration Completeness and Decidability of a Fragment of Duration Calculus with Iteration
The mission of UNU/IIST is to assist developing countries in the application and development of software technology. UNU/IIST contributes through its programmatic activities: 1. advanced development projects in which software techniques supported by tools are applied, 2. research projects in which new techniques for software development are investigated, 3. curriculum development projects in wh...
متن کاملOn the Decidability of Continuous Time Speci cationFormalismsA
We consider an interpretation of monadic second-order logic of order in the continuous time structure of nitely variable signals and show the decidability of monadic logic in this structure. The expressive power of monadic logic is illustrated by providing a straightforward meaning preserving translation into monadic logic of three typical continuous time speciication formalism: Temporal Logic ...
متن کاملProbabilistic Mu-Calculus: Decidability and Complete Axiomatization
We introduce a version of the probabilistic μ-calculus (PMC) built on top of a probabilistic modal logic that allows encoding n-ary inequational conditions on transition probabilities. PMC extends previously studied calculi and we prove that, despite its expressiveness, it enjoys a series of good metaproperties. Firstly, we prove the decidability of satisfiability checking by establishing the s...
متن کاملTerminating Tableaux for the Basic Fragment of Simple Type Theory
We are interested in higher-order fragments of classical simple type theory [1, 6] for which it is decidable whether a formula is satisfied by a standard model. Only few such fragments are known: • The propositional fragment, which is obtained by admitting no other base type but the type of truth values. In this case decidability follows from the fact that all types are interpreted as finite se...
متن کاملA Theory of Duration Calculus with Application
In this chapter we will present selected central elements in the theory of Duration Calculus and we will give examples of applications. The chapter will cover syntax, semantics and proof system for the basic logic. Furthermore, results on decidability, undecidability and model-checking will be presented. A few extensions of the basic calculus will be described, in particular, Hybrid Duration Ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999